Linearly Scalable Computation of Smooth Molecular Surfaces
نویسندگان
چکیده
An algorithm for fast computation of Richards's smooth molecular surface is described. Our algorithm is easily parallelizable and scales linearly with the number of atoms in
منابع مشابه
Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملFast Error-bounded Surfaces and Derivatives Computation for Volumetric Particle Data
Volumetric smooth particle data arise as atomic coordinates with electron density kernels for molecular structures, as well as fluid particle coordinates with a smoothing kernel in hydrodynamic flow simulations. In each case there is the need for efficiently computing approximations of relevant surfaces (molecular surfaces, material interfaces, shock waves, etc), along with surface and volume d...
متن کاملOn the Projective Normality of Smooth Surfaces of Degree Nine
The projective normality of smooth, linearly normal surfaces of degree 9 in P is studied. All non projectively normal surfaces which are not scrolls over a curve are classified. Results on the projective normality of surface scrolls are also given.
متن کاملFast Analytical Computation of Richards's Smooth Molecular Surface
An algorithm for rapid computation of Richards's smooth molecular surface is described. The entire surface is computed analytically, triangulated, and displayed at interactive rates. The faster speeds for our program have been achieved by algorithmic improvements, parallelizing the computations, and by taking advantage of the special geometrical properties of such surfaces. Our algorithm is eas...
متن کاملClimbing Mount Scalable: Physical Resource Requirements for a Scalable Quantum Computer
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. ...
متن کامل